The Smallest Randić Index for Trees
نویسندگان
چکیده
The general Randić index Rα(G) is the sum of the weight d(u)d(v)α over all edges uv of a graph G, where α is a real number and d(u) is the degree of the vertex u of G. In this paper, for any real number α = 0, the first three minimum general Randić indices among trees are determined, and the corresponding extremal trees are characterized.
منابع مشابه
General Randić indices for matching and $\cal{L}$-characteristics polynomial of Starlike trees
Here we study the normalized Laplacian characteristics polynomial (L-polynomial) for trees and specifically for starlike trees. We describe how the L-polynomial of a tree depends on some topological indices. For which, we also define the higher order general Randić indices for matching and which are different from higher order connectivity indices. Finally we provide the multiplicity of the eig...
متن کاملOn the Ordering of Trees with the General Randić Index of the Nordhaus-Gaddum Type
The general Randić index of an organic molecule whose molecular graph is G is defined as the sum of (d(u)d(v))α over all pairs of adjacent vertices of G, where d(u) is the degree of the vertex u in G and α is a real number with α 6= 0. In the paper, we obtained sharp bounds on the general Randić index of the Nordhaus-Gaddum type for trees. Also we show that the general Randić index of the Nordh...
متن کاملOn the Modified Randić Index of Trees, Unicyclic Graphs and Bicyclic Graphs
The modified Randić index of a graph G is a graph invariant closely related to the classical Randić index, defined as
متن کاملThe asymptotic value of Randic index for trees
Let Tn denote the set of all unrooted and unlabeled trees with n vertices, and (i, j) a double-star. By assuming that every tree of Tn is equally likely, we show that the limiting distribution of the number of occurrences of the double-star (i, j) in Tn is normal. Based on this result, we obtain the asymptotic value of Randić index for trees. Fajtlowicz conjectured that for any connected graph ...
متن کاملBest lower and upper bounds for the Randić index R−1 of chemical trees
The general Randić index Rα(G) of a graph G is defined as the sum of the weights (d(u)d(v)) α of all edges uv of G, where d(u) denotes the degree of a vertex u in G and α is an arbitrary real number. Clark and Moon gave the lower and upper bounds for the Randić index R −1 of all trees, and posed the problem to determine better bounds. In this paper we give the best possible lower and upper boun...
متن کامل